課程資訊
課程名稱
 生產與作業排程
Production and Operations Scheduling 
開課學期
 102-1 
授課對象
 工學院  工業工程學研究所  
授課教師
 黃奎隆 
課號
 IE5041 
課程識別碼
 546EU6110 
班次
  
學分
 3 
全/半年
 半年 
必/選修
 選修 
上課時間
 星期五2,3,4(9:10~12:10) 
上課地點
 國青233 
備註
 本課程以英語授課。
總人數上限：25人 
Ceiba 課程網頁
 http://ceiba.ntu.edu.tw/1021scheduling 
課程簡介影片
 
核心能力關聯
 核心能力與課程規劃關聯圖
課程大綱
為確保您我的權利,請尊重智慧財產權及不得非法影印
課程概述

The course covers fundamental integer programming techniques, including cutting plane methods, branch-and-bound enumeration, Bender’s decomposition, Lagrangain relaxation/decomposition, and heuristic/meta-heuristic programming. It also covers special techniques for solving well-known combinatorial problems, such as knapsack problem and the set covering/partition problem. 

課程目標
 The course primarily focuses on study of Integer Programming and gives an overview of classical methods about problem formulations and solving. The goal of this course is to provide students some understanding such as why some problems are difficult to solve, how they can be reformulated to yield better results, and how effective different algorithms can be. 
課程要求
 Your grade in the course will be determined by homework (20%), midterm exam (35%), final exam (30%) and project (15%). The requirements in details are described as follows:
* Homework will be assigned every two weeks and the assignments need to be done independently. Late submissions are not accepted except a prior approval is received from the instructor.
* There are one midterm and one final exam.
* There is a final project which helps students comprehend the class material and apply them to practical problems or real cases. The project may consist of a literature review for an application area, a research problem, or a computational study. 2 to 3 students (may vary upon the class size) form a group. Prepare a 20-min presentation and submit a report in the last class.
 
預期每週課後學習時數
  
Office Hours
  
指定閱讀
  
參考書目
 H.M. Salkin and K. Mathur, Foundations of Integer Programming, North-Holland, New York, 1989
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley 1988.
L.A. Wolsey, Integer Programming, Wiley 1998.
 
評量方式
(僅供參考)
    
課程進度
週次
日期
單元主題
Week 1
 09/13  Introduction 
Week 2
 09/20  No class 
Week 3
 09/27  Deterministic Models: Preliminaries 
Week 4
 10/04  Single Machine Model 
Week 5
 10/11  Advanced Single Machine Models 
Week 6
 10/18  Advanced Single Machine Models 
Week 7
 10/25  Parallel Machines 
Week 8
 11/01  Parallel Machines 
Week 9
 11/08  Flowshop Scheduling 
Week 10
 11/15  No class 
Week 11
 11/22  Midterm 
Week 12
 11/29  Flow Shop and Job Shop 
Week 13
 12/06  Job Shop and Open Shop 
Week 14
 12/13  Open Shop and General Purpose Procedures for Deterministic Scheduling 
Week 15
 12/20  Advanced General Scheduling 
Week 16
 12/27  Advanced General Scheduling 
Week 17
 01/03  Final Project 
Week 18
 01/10  Final Exam